Graphs cospectral with distance-regular graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A construction of distance cospectral graphs

The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edge counts yet are cospectral with respect to the distance matrix. Further, we identify a subgraph switching behavior which constructs additional dis...

متن کامل

On marker set distance cospectral graphs

Let G = (V ,E) be a simple undirected connected graph and let M be a nonempty subset of vertices of G. Using the results we have derived in our previous paper on marker set distance matrix, we define two graphs G1 with a marker set M1 and G2 with a marker set M2 to be marker set cospectral if they have the same marker distance spectrum. In this paper, we obtain the conditions under which two gr...

متن کامل

Cospectral regular graphs with and without a perfect matching

For each b ≥ 5 we construct a pair of cospectral b-regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third author at the 22nd British Combinatorial Conference.

متن کامل

Distance-Regular Graphs with Strongly Regular Subconstituents

In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .

متن کامل

Edge-distance-regular graphs are distance-regular

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 1995

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081089508818382